Time and space bounds for reversible simulation
نویسندگان
چکیده
منابع مشابه
Time and Space Bounds for Reversible Simulation
We prove a general upper bound on the trade-off between time and space that suffices for the reversible simulation of irreversible computation. Previously, only simulations using exponential time or quadratic space were known. The trade-off shows for the first time that we can simultaneously achieve subexponential time and subquadratic space. The boundary values are the exponential time with ha...
متن کاملReversible space-time simulation of cellular automata
We brieey recall the deenitions of Cellular automata (ca), simulation, re-versibility and Partitioned cellular automata (pca) as deened by Morita. We call the sequence of the iterated conngurations of a connguration a space-time diagram. We deene an embedding relation between space-time diagrams and a space-time simulation relation between ca. We built a space-time simulation of any ca by a rev...
متن کاملTime and Space Bounds for Planning
There is an extensive literature on the complexity of planning, but explicit bounds on time and space complexity are very rare. On the other hand, problems like the constraint satisfaction problem (CSP) have been thoroughly analysed in this respect. We provide a number of upperand lower-bound results (the latter based on various complexitytheoretic assumptions such as the Exponential Time Hypot...
متن کاملTime/Space Trade-Offs for Reversible Computation
A reversible Turing machine is one whose transition function is 1, so that no instantaneous description (ID) has more than one predecessor. Using a pebbling argument, this paper shows that, for any e > 0, ordinary multitape Turing machines using time T and space S can be simulated by reversible ones using time O(T +) and space O(S log T) or in linear time and space O(ST). The former result impl...
متن کاملConditional Lower Bounds for Space/Time Tradeoffs
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on well-studied hardness assumptions such as 3SUM, APSP, SETH, etc. This line of research helps to obtain a better understanding of the complexity inside P. A ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2001
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/34/35/308